T-tree Index Optimization Based on Main Memory Database
نویسندگان
چکیده
منابع مشابه
T-Tree or B-Tree: Main Memory Database Index Structure Revisited
* The second author's work is partially supported by a grant from the Research Grant Council of Hong Kong Special Administrative Region, China (No. HKUST758/96E ). The third author's work is partially supported by a grant from Sino Software Research Institute (No. SSRI97/98.EG02). 1 On leave from the School of Computing, The National University of Singapore. 2 Currently a visiting scholar at th...
متن کاملMulti-tenant Main Memory Index Tree with Shared Structure
Multi-tenant main memory index is an important tool to accelerate data access to software as a service. Establishing main memory indexes for each tenant occupies lots of memory space and results in performance bottleneck. The data schemas and access patterns of different tenants are similar, which provides the conditions for tenants storing their index entries with shared structure in main memo...
متن کاملTowards efficient main-memory use for optimum tree index update
An emerging class of database applications is characterized by frequent updates of low-dimensional data, e.g. coming from sensors that sample continuous real world phenomena. Traditional persistency requirements can be weakened in this setting of frequent updates, emphasizing a role of the main-memory in external storage index structures and enabling a higher update throughput. Moreover, in ord...
متن کاملT -tree: Main Memory Index Structure with Concurrency Control and Recovery
While B+trees are the most popular index structure for disk databases, the T-Tree has been widely accepted as a promising index structure for main memory databases. For over two decades the speed of CPUs has increased faster than the speed of the main memory. Therefore, the speed gap of the CPU and memory has rapidly become steeper, and memory access has become the new bottleneck in databases. ...
متن کاملBuilding a Columnar Database on Shared Main Memory-Based Storage
In the field of disk-based parallel database management systems exists a great variety of solutions based on a shared-storage or a shared-nothing architecture. In contrast, main memory-based parallel database management systems are dominated solely by the shared-nothing approach as it preserves the in-memory performance advantage by processing data locally on each server. We argue that this uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2017
ISSN: 2475-8841
DOI: 10.12783/dtcse/itms2016/9459